Knuth-Bendix Completion for Non-Symmetri Transitive Relations

نویسنده

  • Georg Struth
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach to Ordered Chaining

We present a new method for proving completeness of ordered chaining calculi for resolution-based rst-order reasoning with transitive relations. Previously, chaining rules were postulated and a posteriori ver-iied in semantic completeness proofs. We synthesize the rules from the transitivity axiom. Completeness of our calculi then follows from cor-rectness of their construction. Our method yiel...

متن کامل

Reduction Relations

The goal of the article is to start the formalization of Knuth-Bendix completion method (see [2], [10] or [1]; see also [11],[9]), i.e. to formalize the concept of the completion of a reduction relation. The completion of a reduction relation R is a complete reduction relation equivalent to R such that convertible elements have the same normal forms. The theory formalized in the article include...

متن کامل

Knuth - Bendix Completion with Modern Termination Checking

KNUTH-BENDIX COMPLETION WITH MODERN TERMINATION CHECKING

متن کامل

Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm

Reduction Systems and Idea of Knuth-Bendix Completion Algorithm Grzegorz Bancerek Association of Mizar Users Białystok, Poland Summary. Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, ChurchRosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].

متن کامل

. C O ] 1 3 Ju l 1 99 9 Logged Rewriting Procedures with Application to Identities Among Relations

We introduce logged rewrite systems and present a variation on the Knuth-Bendix algorithm for obtaining (where possible) complete logged rewrite systems. This procedure is then applied to work of Brown and Razak Salleh, and an algorithm is developed which provides a set of generators for the module of identities among relations of a group presentation. Supported by a University of Wales, Bangor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001